13 research outputs found
Updating Graph Databases with Cypher
International audienc
G-CORE a core for future graph query languages
We report on a community effort between industry and academia to
shape the future of graph query languages. We argue that existing
graph database management systems should consider supporting
a query language with two key characteristics. First, it should be
composable, meaning, that graphs are the input and the output of
queries. Second, the graph query language should treat paths as
first-class citizens. Our result is G-CORE, a powerful graph query
language design that fulfills these goals, and strikes a careful balance
between path query expressivity and evaluation complexity
G-CORE a core for future graph query languages
We report on a community effort between industry and academia to shape the future of graph query languages. We argue that existing graph database management systems should consider supporting a query language with two key characteristics. First, it should be composable, meaning, that graphs are the input and the output of queries. Second, the graph query language should treat paths as first-class citizens. Our result is G-CORE, a powerful graph query language design that fulfills these goals, and strikes a careful balance between path query expressivity and evaluation complexity
Graph Pattern Matching in GQL and SQL/PGQ
As graph databases become widespread, JTC1 -- the committee in joint charge
of information technology standards for the International Organization for
Standardization (ISO), and International Electrotechnical Commission (IEC) --
has approved a project to create GQL, a standard property graph query language.
This complements a project to extend SQL with a new part, SQL/PGQ, which
specifies how to define graph views over an SQL tabular schema, and to run
read-only queries against them.
Both projects have been assigned to the ISO/IEC JTC1 SC32 working group for
Database Languages, WG3, which continues to maintain and enhance SQL as a
whole. This common responsibility helps enforce a policy that the identical
core of both PGQ and GQL is a graph pattern matching sub-language, here termed
GPML.
The WG3 design process is also analyzed by an academic working group, part of
the Linked Data Benchmark Council (LDBC), whose task is to produce a formal
semantics of these graph data languages, which complements their standard
specifications.
This paper, written by members of WG3 and LDBC, presents the key elements of
the GPML of SQL/PGQ and GQL in advance of the publication of these new
standards
PG-Schema: Schemas for Property Graphs
Property graphs have reached a high level of maturity, witnessed by multiple
robust graph database systems as well as the ongoing ISO standardization effort
aiming at creating a new standard Graph Query Language (GQL). Yet, despite
documented demand, schema support is limited both in existing systems and in
the first version of the GQL Standard. It is anticipated that the second
version of the GQL Standard will include a rich DDL. Aiming to inspire the
development of GQL and enhance the capabilities of graph database systems, we
propose PG-Schema, a simple yet powerful formalism for specifying property
graph schemas. It features PG-Types with flexible type definitions supporting
multi-inheritance, as well as expressive constraints based on the recently
proposed PG-Keys formalism. We provide the formal syntax and semantics of
PG-Schema, which meet principled design requirements grounded in contemporary
property graph management scenarios, and offer a detailed comparison of its
features with those of existing schema languages and graph database systems.Comment: 25 page
The Future is Big Graphs! A Community View on Graph Processing Systems
Graphs are by nature unifying abstractions that can leverage
interconnectedness to represent, explore, predict, and explain real- and
digital-world phenomena. Although real users and consumers of graph instances
and graph workloads understand these abstractions, future problems will require
new abstractions and systems. What needs to happen in the next decade for big
graph processing to continue to succeed?Comment: 12 pages, 3 figures, collaboration between the large-scale systems
and data management communities, work started at the Dagstuhl Seminar 19491
on Big Graph Processing Systems, to be published in the Communications of the
AC
G-CORE a core for future graph query languages
We report on a community effort between industry and academia to
shape the future of graph query languages. We argue that existing
graph database management systems should consider supporting
a query language with two key characteristics. First, it should be
composable, meaning, that graphs are the input and the output of
queries. Second, the graph query language should treat paths as
first-class citizens. Our result is G-CORE, a powerful graph query
language design that fulfills these goals, and strikes a careful balance
between path query expressivity and evaluation complexity
G-CORE a core for future graph query languages
\u3cp\u3eWe report on a community effort between industry and academia to shape the future of graph query languages. We argue that existing graph database management systems should consider supporting a query language with two key characteristics. First, it should be composable, meaning, that graphs are the input and the output of queries. Second, the graph query language should treat paths as first-class citizens. Our result is G-CORE, a powerful graph query language design that fulfills these goals, and strikes a careful balance between path query expressivity and evaluation complexity.\u3c/p\u3